Cooperation in the Prisoner's Dilemma with Anonymous Random Matching
نویسنده
چکیده
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
منابع مشابه
Evolution and Information in a Prisoner’s Dilemma Game
In an environment of anonymous random matching, Kandori [1992] showed that with a sufficiently rich class of simple information systems the folk theorem holds. We specialize to the Prisoner’s Dilemma and examine the stochastic stability of a process of learning and evolution in this setting. If the benefit of future cooperation is too small, then there is no cooperation. When the benefit of coo...
متن کاملEmergence of Cooperation in Anonymous Social Networks through Social Capital
We study the emergence of cooperation in dynamic, anonymous social networks, such as in online communities. We examine prisoner’s dilemma played under a social matching protocol, where individuals form random links to partners with whom they can interact. Cooperation results in mutual benefits, whereas defection results in a high short-term gain. Moreover, an agent that defects can escape recip...
متن کاملUniform folk theorems in repeated anonymous random matching games
We study infinitely repeated anonymous random matching games played by communities of players, who only observe the outcomes of their own matches. It is well known that cooperation can be sustained in equilibrium for the prisoner’s dilemma (PD) through grim trigger strategies. Little is known about games beyond the PD. We study a new equilibrium concept, strongly uniform equilibrium (SUE, which...
متن کاملEntanglement Guarantees Emergence of Cooperation in Quantum Prisoner's Dilemma Games on Networks
It was known that cooperation of evolutionary prisoner's dilemma games fails to emerge in homogenous networks such as random graphs. Here we proposed a quantum prisoner's dilemma game. The game consists of two players, in which each player has three choices of strategy: cooperator (C), defector (D) and super cooperator (denoted by Q). We found that quantum entanglement guarantees emergence of a...
متن کاملCooperation in Anonymous Dynamic Social Networks ∗ Preliminary Working Paper
We study the extent to which cooperative behavior can be sustained in large, anonymous, evolving social networks. Individuals strategically form relationships under a social matching protocol and engage in prisoner’s dilemma interactions with their partners. We characterize a class of equilibria that support cooperation as a stationary outcome. When cooperation is possible, its level is uniquel...
متن کامل